package hotLeetcode;

public class H153Leetcode {
    public int findMin(int[] nums) {
        int left = 0, right = nums.length - 1;
        while (left < right) {
            int mid = left + (right - left) / 2;

            //左边有序
            if (nums[mid] < nums[right]) {
                right = mid;
            } else {
                left = mid + 1;

            }
        }

        return nums[right];

    }

}
